An Exact FCFS Waiting Time Analysis for a General Class of G/G/s Queueing Systems

نویسنده

  • Dimitris Bertsimas
چکیده

A closed form expression for the waiting time distribution under FCFS is derived for the queueing system MGE k / M G E m/s , where MGE n is the class of mixed generalized Erlang probability density functions (pdfs) of order n, which is a subset of the Coxian pdfs that have rational Laplace transform. Using the calculus of difference equations and based on previous results of the author, it is proved that the waiting time distribution is of the form 1 )~(s+m-1) t ~ u t )~a ~y~ ~, under the assumption that the roots uy are distinct, i.e. belongs to the Coxian class of distributions of order (~+m-1). The present approach offers qualitative insight by providing exact and asymptotic expressions, generalizes and unifies the well known theories developed for the G / G / l , G / M / s systems and leads to an O(k3(~+m-1) 3) algorithm, which is polynomial if only one of the parameters s or m varies, and is exponential if both parameters vary. As an example, numerical results for the waiting time distribution of the M G E 2 / M G E 2 / s queueing system are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of a Finite Buffer Queue with Different Scheduling and Push-Out Schemes

A queueing system M1, M 2 / G 1, G 2 / 1 / N with different scheduling and push-out scheme is analyzed in this paper. This work is motivated by the study of the performance of an output link of ATM switches with traffic of two classes with different priorities. However, the queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priorit...

متن کامل

Analysis of M/G/ 1 queueing model with state dependent arrival and vacation

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...

متن کامل

Scheduling for efficiency and fairness in systems with redundancy

Server-side variability—the idea that the same job can take longer to run on one server than another due to server-dependent factors—is an increasingly important concern in many queueing systems. One strategy for overcoming server-side variability to achieve low response time is redundancy, under which jobs create copies of themselves and send these copies to multiple different servers, waiting...

متن کامل

A sample path relation for the sojourn times in G/G/1-PS systems and its applications

For the general G/G/1 processor sharing (PS) system a sample path result for the sojourn times in a busy period is proved, which yields a relation between the sojourn times under PS and FCFS discipline. In particular, the result provides a formula for the mean sojourn time in G/D/1-PS in terms of the mean sojourn time in the corresponding G/D/1-FCFS, generalizing known results for GI/M/1 and M/...

متن کامل

Emergency Location Problems with an M/G/k Queueing System

  Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1988